Classifying pole-skipping points
نویسندگان
چکیده
A bstract We clarify general mathematical and physical properties of pole-skipping points. For this purpose, we analyse scalar vector fields in hyperbolic space. This setup is chosen because it simple enough to allow us obtain analytical expressions for the Green’s function check everything explicitly, while contains all essential features classify points three types (type-I, II, III). Type-I Type-II are distinguished by (limiting) behavior near Type-III can arise at non-integer i? values, which due a specific UV condition, contrary I related non-unique horizon boundary condition. also relation between structure analysis. point out that there subtle cases where analysis alone may not be able capture existence
منابع مشابه
Classifying points for sweeping solids
Many diverse engineering problems can be modeled with solid sweeping in a conceptually simple and intuitive way, and sweeps are considered to be one of the basic representation schemes in solid modeling. However, many properties of sweeps as well as their “informational completeness” are not well understood, which is the primary reason why computational support for solid sweeping remains scarce...
متن کاملA Classifying Procedure for Signaling Turning Points
A Hidden Markov Model (HMM) is used to classify an out of sample observation vector into either of two regimes. This leads to a procedure for making probability forecasts for changes of regimes in a time series, i.e. for turning points. Instead of maximizing a likelihood, the model is estimated with respect to known past regimes. This makes it possible to perform feature extraction and estimati...
متن کاملNear Pole Polar Diagram of Points and its Duality with Applications
In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...
متن کاملClassifying negative and positive points by optimal box clustering
In this paper we address the problem of classifying positive and negative data with the technique known as box clustering. A box is homogeneous if it contains only positive (negative) points. Box clustering means finding a family of homogeneous boxes jointly containing all and only positive (negative) points. We first consider the problem of finding a family with the minimum number of boxes. Th...
متن کاملSkipping Refinement
We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an abstract, highlevel specification system and a concrete, low-level implementation system. One then shows that every behavior allowed by the implementation is also allowed by the specification. Due to the difference i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2021
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep03(2021)175